An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
نویسندگان
چکیده
منابع مشابه
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
Frequencies have to be assigned to transmitters whenever a radio network is established or modified. This is ideally done is a way which minimises interference in the network. Lower bounds are necessary to establish the effectiveness of the heuristic algorithms used for this task and to assess the quality of the assignments obtained. In the fixed spectrum frequency assignment problem the availa...
متن کاملAn improved tabu search algorithm for the fixed-spectrum frequency-assignment problem
A tabu search algorithm with a dynamic tabu list for the fixed-spectrum frequency-assignment problem is presented. For cellular problems, the algorithm can be combined with an efficient cell reoptimization step. The algorithm is tested on several sets of test problems and compared with existing algorithms of established performance. In particular, it is used to improve some of the best existing...
متن کاملUpper and lower bounds for the fixed spectrum frequency assignment problem
Asurvey of the results described in the author’s PhD thesis (Montemanni 2001) is presented. The thesis, which was supervised by Prof. Derek H. Smith and Dr. Stuart M. Allen, has been defended in January 2002 at the University of Glamorgan (U.K.). The thesis proposes new heuristic algorithms, based on well-known metaheuristic paradigms, and new lower bounding techniques, based on linear programm...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولPath relinking for the fixed spectrum frequency assignment problem
The fixed spectrum frequency assignment problem (FS-FAP) is a highly relevant application in modern wireless systems. This paper presents the first path relinking (PR) approach for solving FS-FAP. We devise four relinking operators to generate intermediate solutions (or paths) and a tabu search procedure for local optimization. We also adopt a diversity-and-quality technique to maintain populat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2004
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(03)00127-9